层次分析法在修理级别分析中的应用

修理级别的非经济性分析有多个结果时,很难确定产品的合理修理级别,若采用经济性分析,数据采集难,并且可操作性差.因此,提出用层次分析法来决断产品合理修理级别的方法,以提高修理级别分析方法的可操作性,并为其工程化提供一种思路.     

层次分析法在雷达侦察机仿真试验置信度评估中的应用

本文从雷达侦察机仿真试验系统的实际出发,简要地介绍了试验系统的组成,分析了各系统设备对试验结果的影响因素,说明了利用层次分析法解决实际问题的一般步骤和方法,最后给出了层次分析法在雷达侦察机仿真试验置信度评估中的应用实例。     

New results on rendezvous search on the interval

In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013     

The graph association problem: Mathematical models and a lagrangian heuristic

Graph association is the problem of merging many graphs that collectively describe a set of possibly repetitive entities and relationships into a single graph that contains unique entities and relationships. As a form of data association, graph association can be used to identify when two sensors are observing the same object so information from both sensors can be combined and analyzed in a meaningful and consistent way. Graph association between two graphs is related to the problem of graph matching, and between multiple graphs it is related to the common labeling of a graph set (also known as multiple graph matching) problem. This article contribution is to formulate graph association as a binary linear program and introduce a heuristic for solving multiple graph association using a Lagrangian relaxation approach to address issues with between‐graph transitivity requirements. The algorithms are tested on a representative dataset. The developed model formulation was found to accurately solve the graph association problem. Furthermore, the Lagrangian heuristic was found to solve the developed model within 3% of optimal on many problem instances, and found better solutions to large problems than is possible by directly using CPLEX. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

一种新闻事件演化建模方法

为了准确地发现话题中事件间的潜在关系,提出一种新闻事件演化建模方法。该方法利用事件的时间关系、内容相似性、命名实体关联信息构建新的演化关系模型,并通过定义事件的五种演化模式,识别出演化过程中的开始、中间、结束事件,最后根据新演化模型及演化模式建立事件演化的有向无环图模型,揭示事件发展的潜在脉络结构。实验结果表明,本文方法能够有效检测事件演化,提升系统性能。     

灰数兰彻斯特方程

为解决联合作战模拟中武器装备的作战能力评估问题,提出了基于打击力、机动力、信息力、防护力、保障力等的武器装备作战能力灰色层次分析模型,目的在于提供在联合作战模拟中,对武器装备的作战能力进行比较的算法。即从打击、机动、信息、防护、保障等来考虑武器装备的性能,采用灰色层次分析的方法,根据灰数的大小确定各类各对象的优劣,由此做出作战能力的合理判断,给出了实例及求解方案。最后,提出了不同灰类的总评估系数作为损耗方程的损耗系数的设想及其算例。     

基于图分割的机械系统概念模块划分

为更好地实现机械系统的模块化设计,在基于功能-行为-概念结构(function-behavior-conceptualstructure,FBCS)的产品概念设计过程中引入面向产品概念要素的图分割聚类算法,建立了一种面向FBCS的产品概念模块划分方法。以堆垛机推拉机构为例,分析了根据产品的总体目标特征,进行产品功能、行为、概念结构求解与功能分解迭代的产品概念设计分解方法。为描述概念产品,提出黑箱法和IDEF0功能描述方法相结合的概念产品建模方法,以建立产品子功能-概念结构模型。在此基础上,建立了产品概念要素(功能、行为、概念结构、接口)的相关关系分析方法,并引入图分割聚类算法进行产品概念要素聚合,以实现产品概念模块的划分。推拉机构的概念模块划分证明该方法是可行和有效的。     

基于层次分析法的化工企业火灾风险评估研究

化工企业火灾风险评估对于化工生产至关重要。针对化工行业的火灾风险,结合层次分析法和模糊识别模式的优点,提出了基于层次分析—模糊识别的综合评价方法,并通过实例评估证明了这种评价方法行之有效。     

军品能力建设项目后的一种评价方法

由于军品的特殊性,其后评价标准与其他民品项目有所不同,根据军品技改项目的特点结合一般项目后评价内容,确定了军品技改项目后评价指标体系,共分为项目目标评价、项目实施管理评价、项目生产运营评价、项目生产力评价、项目经营效益评价、项目影响评价和项目持续性评价等7部分25个指标小项,并采用层次灰色法建立了军品技改项目后评价模型,为客观科学地进行军品技改项目的后评价提供了依据.     

具有正交(g,f)-因子分解的子图

设G是一个图 ,g (x)和f (x)是定义在V (G)上的整数值函数 ,且对任意的x∈V (G) ,设g (x)≤f (x) ,H是G的一个子图 ,F ={F1,F2 ,… ,Ft}是G的一个因子分解 ,如果对任意的 1≤i≤t,|E (H)∩E (Fi) |=1 ,则称F与H正交。闫桂英和潘教峰在文 [3]中提出如下猜想 :设G是一个 (mg+k,mf-k) -图 ,1≤k相似文献